A Framework based on Boolean Satisfiability for Soft Error Rate Computation in Early Design Stages

نویسندگان

  • Syed Z. Shazli
  • Mehdi Tahoori
چکیده

Soft errors, due to cosmic radiations, are the major reliability barrier for VLSI designs. The vulnerability of such systems to soft errors grows exponentially with technology scaling. To meet reliability constraints in a cost-effective way, it is critical to assess soft error reliability parameters in early design stage to optimize reliability in the entire design cycle. Unlike soft error modeling for gate-level netlists, soft error propagation models for high-level behavioral design are not straightforward. In this paper, we present a framework to accurately obtain soft error rate (SER) for high-level (behavioral) descriptions (Verilog or VHDL) in early design stages. We transform the SER computation problem into equivalent Boolean satisfiability problem and use state-of-the-art SATsolvers to obtain SER. We compare our technique to traditional fault simulation techniques. Experiments are carried out on several benchmarks and results are presented.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Algorithms for Satisfiability in Combinational Circuits Based on Backtrack Search and Recursive Learning

Boolean Satisfiability is a ubiquitous modeling tool in Electronic Design Automation (EDA). It finds application in test pattern generation, delay-fault testing, combinational equivalence checking and circuit delay computation, among many other problems. Moreover, Boolean Satisfiability is also in the core of algorithms for solving Binate Covering Problems. This paper starts by describing how B...

متن کامل

Filter theory in MTL-algebras based on Uni-soft property

‎The notion of (Boolean) uni-soft filters‎ ‎in MTL-algebras is introduced‎, ‎and several properties of them are‎ ‎investigated‎. ‎Characterizations of (Boolean) uni-soft filters are discussed‎, ‎and some (necessary and sufficient) conditions‎ ‎for a uni-soft filter to be Boolean are provided‎. ‎The condensational property for a Boolean uni-soft filter is established.

متن کامل

6roylqjwkh6dwlvildelolw\3ureohp 7kurxjkk%rrohdqq1hwzrunv ,qwurgxfwlrq

. In this paper we present a new approach to solve the satisfiability problem (SAT), based on boolean networks (BN). We define a mapping between a SAT instance and a BN, and we solve SAT problem by simulating the BN dynamics. We prove that BN fixed points correspond to the SAT solutions. The mapping presented allows to develop a new class of algorithms to solve SAT. Moreover, this new approach ...

متن کامل

VLSI Circuit Configuration Using Satisfiability Logic in Hopfield Network

Very large scale integration (VLSI) circuit comprises of integrated circuit (IC) with transistors in a single chip, widely used in many sophisticated electronic devices. In our paper, we proposed VLSI circuit design by implementing satisfiability problem in Hopfield neural network as circuit verification technique. We restrict our logic construction to 2-Satisfiability (2-SAT) and 3Satisfiabili...

متن کامل

Algorithms for Solving Boolean Satisfiability in Combinational Circuits

Boolean Satisfiability is a ubiquitous modeling tool in Electronic Design Automation, It finds application in test pattern generation, delay-fault testing, combinational equivalence checking and circuit delay computation, among many other problems. Moreover, Boolean Satisfiability is in the core of algorithms for solving Binate Covering Problems. This paper describes how Boolean Satisfiability ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008